Diffusive transport on networks with stochastic resetting to multiple nodes

We study the diffusive transport of Markovian random walks on arbitrary networks with stochastic resetting to multiple nodes. deduce analytical expressions for stationary occupation probability and mean global first passage times. This general approach allows us characterize effect capacity walk strategies reach a particular target or explore network. Our formalism holds ergodic can be implemented from spectral properties without resetting, providing tool analyze efficiency search apply methods developed here dynamics two reset nodes derive results normal L\'evy flights rings. also comb graph, that visit specific locations in continuous space, Google strategy regular networks.